منابع مشابه
Highness and Bounding Minimal Pairs
We show the existence of a high r.e. degree bounding only joins of minimal pairs and of a high2 nonbounding r.e. degree.
متن کاملBounding and nonbounding minimal pairs in the enumeration degrees
We show that every nonzero ∆ 2 e-degree bounds a minimal pair. On the other hand, there exist Σ 2 e-degrees which bound no minimal pair.
متن کاملBounding differences in Jager Pairs
Symmetrical subdivisions in the space of Jager Pairs for continued fractions-like expansions will provide us with bounds on their difference. Results will also apply to the classical regular and backwards continued fractions expansions, which are realized as special cases.
متن کاملThe Minimal Bounding Volume Hierarchy
Bounding volume hierarchies (BVH) are a commonly used method for speeding up ray tracing. Even though the memory footprint of a BVH is relatively low compared to other acceleration data structures, they still can consume a large amount of memory for complex scenes and exceed the memory bounds of the host system. This can lead to a tremendous performance decrease on the order of several magnitud...
متن کاملDepth, Highness and DNR Degrees
A sequence is Bennett deep [5] if every recursive approximation of the Kolmogorov complexity of its initial segments from above satisfies that the difference between the approximation and the actual value of the Kolmogorov complexity of the initial segments dominates every constant function. We study for different lower bounds r of this difference between approximation and actual value of the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Logic Quarterly
سال: 1993
ISSN: 0942-5616,1521-3870
DOI: 10.1002/malq.19930390151